package com.singzi.leetcode.N100;

public class T0072 {
}
class Solution0072 {
    public int minDistance(String word1, String word2) {

//        char []words1 = word1.toCharArray();
//        char []words2 = word2.toCharArray();
        int length1 = word1.length();
        int length2 = word2.length();

        int []dp = new int[3];
        dp[0] = length2 + 1;
        for(int i = 0;i < word2.length();i++){
            if (word1.charAt(0) == word2.charAt(i)) {
                dp[0] = length2 - 1;
                break;
            }
        }

        for (int i = 1; i <= length1; i++) {
            for (int j = 0; j < i; j++) {

            }
        }



        return word2.length();

    }
}